Description: 具有图形化界面的一个路由模拟程序。路由算法为Dijkstra算法。具有求出图中任意节点间所有最短路径以及最短路径子图的功能。这是一个点对点(S-T)Dijkstra算法的改进。用于求两点间的所有最短路径。-graphical interface with the simulation of a routing procedures. Routing algorithm Dijkstra algorithm. With map obtained arbitrary nodes all the shortest paths and shortest path graph of the function. This is a peer-to-peer (S-T) Dijkstra algorithm improvements. Seeking 2:00 for all the shortest path. Platform: |
Size: 3072 |
Author:阎一 |
Hits:
Description: 著名的加密算法md5的通用算法，并有单次算法和多次算法的直接演算-famous encryption algorithm md5 generic algorithms, and algorithm for single and multiple direct routing algorithm Platform: |
Size: 27648 |
Author:李权 |
Hits:
Description: 所实现的路由器采用距离矢量算法，模拟Internet上的IP路由器，它能确定网络的最短路由，并在其上传输分组-router achieved by the application of the distance vector algorithm simulation on the Internet IP routers, it can determine the shortest route network, and in its previous packet transmission Platform: |
Size: 181248 |
Author:agang |
Hits:
Description: Distance Vector Routing，也称为Bellman-Ford shortest path algorithm。基本思想是：
每个路由器（路由结点）都维持一张路由表，包括路由的目的地(V)和路由的距离(D)。每个路由器都定期与相邻结点交换路由表信息，据此更新它们自己的路由表。所有结点都监听从其它结点传来的路由表，并按照下列规则更新其路由表：
-发现了一条到达某目的结点的新路由，而该路由在原来的路由表中不存在（即发现了一条新路由），则在路由表中增加该路由。
-发现了一条到达某目的结点的、距离更短的新路由，则用该路由替换原有的路由。
-到达某目的结点的一条路由，其后继结点到达该目的地的距离发生了变化，则需要更新该路由的距离。
本文件中包含详细的源代码和注释，以实现利用距离向量算法更新路由表的功能。-Distance Vector Routing, also known as the Bellman-Ford shortest path algorithm. The basic idea is : Each router (routing nodes) has maintained a routing table, the destinations include routing (V) and the routing of distance (D). Each router regularly with neighboring nodes to exchange routing table information, updated accordingly their own routing table. All nodes are monitored from other nodes sent a routing table, and in accordance with the following rules to update its routing table :- found a purpose to reach a node of the new routing, The routing of the original routing table does not exist (that is, found a new routing), the routing table to increase the routing.- Found a purpose to reach an end point, the short distance between the new routing, the router can be used to replace Platform: |
Size: 3072 |
Author:agang |
Hits:
Description: java图形界面的动态路由算法，比VC更生动形象，更易于理解。让人清楚理解路由器之间的选路原则，绝对原创。-java graphical interface of the dynamic routing algorithm is more vivid than the VC image, easier to understand. Gave a clear understanding between routers routing principles, is absolutely original. Platform: |
Size: 676864 |
Author:李远川 |
Hits:
Description: ZigBee路由算法分析，基于IEEE802.15.4标准的ZigBee网络是一种具有强大组网能力的新型无线个域网，其中的路由算法是研发工作的重点。本文介绍了IEEE802.15.4标准及ZigBee规范的协议模型，重点研究了ZigBee协议网络层的路由算法，分析了Tree路由及Z-AODV路由算法，在此基础上提出了ZigBee网格型网络中基于数据特性的路由选择机制，该机制在网络性能和低功耗方面有明显的优势，并且可以平衡节点能量，最后简单介绍了ZigBee节点的硬件实现。-ZigBee routing algorithm based on the IEEE802.15.4 standard ZigBee network is a powerful networking capabilities of new wireless personal area network, the routing algorithm is the focus of R & D work. This article describes the IEEE802.15.4 standard and the ZigBee specification of the protocol model, focused on the ZigBee protocol network layer routing algorithm, Tree Routing and Z-AODV routing algorithm based on the ZigBee mesh network based on data characteristics of routing mechanism, the mechanism has an obvious advantage in network performance and low power consumption, and can balance the node energy, and finally a brief introduction to the hardware implementation of the ZigBee node. Platform: |
Size: 76800 |
Author:朱程序 |
Hits:
Description: 根据链路的使用情况赋权值，并综合考虑带宽和跳数限制的最小权值TE路由算法。-According to the the link usage Empowerment value and considering the value of the minimum weight limit bandwidth and hops TE routing algorithm. Platform: |
Size: 3975168 |
Author:胡佳 |
Hits:
Description: 链路状态算法（也称最短路径算法）发送路由信息到互联网上所有的结点，然而对于每个路由器，仅发送它的路由表中描述了其自身链路状态的那一部分,其算法思想是每一个路由算法必须完成以下的工作，发现它的邻居节点，并知道其网络地址，测量到各邻居节点的延迟或者开销，构造一个分组，分组中包含所有它刚刚知道的信息，将这个分组发送给所有其他的路由器，计算出到每一个其他路由器的最短路径-Link state algorithm (also known as the shortest path algorithm) to send routing information to the Internet on all nodes, but for each router, it only sends the routing table describing its link state that part, its algorithm is a routing algorithm is required to complete the following work, found its neighbor nodes, and know the network address, measuring to the neighbor node delay or overhead, constructs a packet, packet contains all the information it had just know, the packet is sent to all other routers, calculated to every other router shortest path Platform: |
Size: 70656 |
Author:蒋宇 |
Hits:
Description: 距离矢量路由算法sp2的c语言实现，用VC++做的一个模拟程序，供学习交流。-Distance Vector routing algorithm sp2 c language, using VC++ to do a simulation program for learning exchanges. Platform: |
Size: 262144 |
Author:李力 |
Hits:
Search - routing algorithm